Improved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems
نویسندگان
چکیده
منابع مشابه
Three Algorithms for Flexible Flow-shop Scheduling
Scheduling is an important process widely used in manufacturing, production, management, computer science, and so on. Appropriate scheduling can reduce material handling costs and time. Finding good schedules for given sets of jobs can thus help factory supervisors effectively control job flows and provide solutions for job sequencing. In simple flow shop problems, each machine operation center...
متن کاملCOVERT Based Algorithms for Solving the Generalized Tardiness Flow Shop Problems
Four heuristic algorithms are developed for solving the generalized version of tardiness flow shop problems. We consider the generalized tardiness flow shop model with minimization of the total tardiness as its performance measure. We modify the concept of cost over time (COVERT) for the generalized version of the flow shop tardiness model and employ this concept for developing four algorithms....
متن کاملSolving Flexible Flow-shop Problems by Lpt and Ln Scheduling Algorithms
Scheduling is an important process widely used in manufacturing, production, management, computer science, and so on. Appropriate scheduling not only reduces manufacturing costs but also reduces possibilities for violating due dates. Finding good schedules for given sets of jobs can thus help factory supervisors effectively control job flows and provide solutions for job sequencing. In simple f...
متن کاملSingle-Pass-Based Heuristic Algorithms for Group Flexible Flow-shop Scheduling Problems
In this paper, four algorithms based on some single-pass heuristics are proposed to solve the flexible flow-shop group scheduling problems with more than two machine centers, which have the same number of parallel machines. Single-pass heuristics need less computation time than multiple-pass ones. The single-pass heuristics adopted in the paper includes the PT, the Palmer and the Gupta algorith...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Industrial Engineering International
سال: 2017
ISSN: 1735-5702,2251-712X
DOI: 10.1007/s40092-017-0244-4